Optimal Path Planning for Unmanned Aircraft Target Observation Through Constrained Urban Environments
نویسندگان
چکیده
منابع مشابه
Multi-query Path Planning for an Unmanned Fixed-Wing Aircraft
Path planning for fixed-wing aircraft in obstacle rich environments requires the consideration of the motion constraints of the aircraft. Most existing motion planning algorithms for systems with dynamics are single query planners, which leads to a large computation overhead if multiple path planning problems are solved. This paper presents a roadmapbased multi-query path planner which generate...
متن کاملOptimal Control for Constrained Coverage Path Planning
The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider augmenting the linear sweep-based coverage method to achieve minimum energy/ time optimality along with maximum area coverage. In addition, we also study the ef...
متن کاملSafe-Path Graph Generation for Path Planning in Urban Environments
To serve as a platform for multi-agent research, the BYU MAGICC Lab has created a version of the game of capturethe-flag played in a maze environment that can be configured to model a variety of indoor and urban settings. Each competing team has mobile robots on the ground, a simulated UAV flying overhead, and a remote human commander. Since simultaneous low-level control of all robots is not p...
متن کاملPeriodic Energy-Optimal Path Planning for Solar-Powered Aircraft
[Abstract] This paper considers energy-optimal path planning in a loitering mission for solar-powered unmanned aerial vehicles (UAVs) which collect solar energy from the sun to power their flight. We consider ascending and descending flight maneuvers in a periodic mission constrained to the surface of a vertical cylinder. The coupling of the aircraft kinematic and energetic models is treated in...
متن کاملOptimal robust path planning in general environments
We address robust path planning for a mobile agent in a general environment by finding minimum cost source-destination paths having prescribed widths. The main result is a new approach that optimally solves the robust path planning problem using an efficient network flow formulation. Our algorithm represents a significant departure from conventional shortest-path or graph search based methods; ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Air Transportation
سال: 2019
ISSN: 2380-9450
DOI: 10.2514/1.d0141